Phase-field-crystal modelling of the (2 × 1)–(1 × 1) phase transitions of Si(0 0 1) and Ge(0 0 1) surfaces
نویسندگان
چکیده
منابع مشابه
0 0 2 1 − 2 − 1 1 0 1 1 − 1 − 1 0 0 0 1 − 1
This article is to contribute to the classification of finite-dimensional complex pointed Hopf algebras with Weyl groups of E6, E7, F4, G2. Many papers are about the classification of finite dimensional pointed Hopf algebras, for example, [AS98, AS02, AS00, AS05, He06, AHS08, AG03, AFZ, AZ07, Gr00, Fa07, AF06, AF07, ZZC, ZC]. In these research ones need the centralizers and character tables of ...
متن کامل50 32 v 1 3 1 M ay 2 00 0 Computational Complexity and Phase Transitions
Phase transitions in combinatorial problems have recently been shown [2] to be useful in locating “hard” instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been addressed in Statistical Mechanics [2] and Artificial Intelligence [3], but not studied rigorously. We take a first step in this direction by investigating the...
متن کاملF 0 1 2 3 2 N ? 2 2 N ? 1 0 0 0 0 0 0 0 1 1 2 2 2 2 2
13 Proof: R private (f) C private (f) since in any protocol the parties send at least one bit per round. On the other hand, for every privately computable function f the bound R private (f) is achieved by the protocol A f. In any round of this protocol the parties send a message with size at most n. (Note that in steps (2a) and (2b) of A f we may save one bit per round by omitting the most sign...
متن کامل!" #$%&'%& ()*+,"-,%. ,% /,&0$11'%& 2+&1),"&,3 $1 (1$!&4d1,6'%7 !"#$% &"$'()
BitTorrent is the most popular P2P content delivery application where individual users share various type of content with tens of thousands of other users. The growing popularity of BitTorrent is primarily due to the availability of valuable content without any cost for the consumers. However, apart from required resources, publishing (sharing) valuable (and often copyrighted) content has serio...
متن کامل2 3 1 1 1 0 0 0 0 1 1 1 2 3 1 2 3 1 3 2 2 3 Adjacency matrix Adjacency list
Graphs and Digraphs: A graph G = (V,E) is a structure that represents a discrete set V objects, called vertices or nodes, and a set of pairwise relations E between these objects, called edges. Edges may be directed from one vertex to another or may be undirected. The term “graph” means an undirected graph, and directed graphs are often called digraphs (see Fig. 1). Graphs and digraphs provide a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics D: Applied Physics
سال: 2008
ISSN: 0022-3727,1361-6463
DOI: 10.1088/0022-3727/42/3/035402